Descent Functions and Random Young Tableaux
نویسندگان
چکیده
منابع مشابه
Random Young Tableaux
We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper Re], we start with probability distributions on the space of the innnite Young tableaux. Then we calculate the probability that the entry of a random tableau at a given box equals n = 1; 2; : : :. Summing these probabilities over n and equa...
متن کاملTruncations of Random Unitary Matrices and Young Tableaux
Let U be a matrix chosen randomly, with respect to Haar measure, from the unitary group U(d). For any k ≤ d, and any k × k submatrix Uk of U, we express the average value of |Tr(Uk)| as a sum over partitions of n with at most k rows whose terms count certain standard and semistandard Young tableaux. We combine our formula with a variant of the Colour-Flavour Transformation of lattice gauge theo...
متن کاملTruncations of a Random Unitary Matrix and Young Tableaux
Abstract. Let U be a matrix chosen randomly, with respect to Haar measure, from the unitary group U(d). We express the moments of the trace of any submatrix of U as a sum over partitions whose terms count certain standard and semistandard Young tableaux. Using this combinatorial interpretation, we obtain a simple closed form for the moments of an individual entry of a random unitary matrix and ...
متن کاملDescent sets for oscillating tableaux
The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role in the representation theory of the symplectic groups as the descent set of a standard tableau plays in the representation theory of the general linear groups. In particular, we show that the descent set is preserved by Sundaram’s correspondence. This gives a direct combinatorial interpret...
متن کاملYoung tableaux
This paper gives a qualitative description how Young tableaux can be used to perform a Clebsch-Gordan decomposition of tensor products in SU(3) and how this can be generalized to SU(N).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2001
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548301004679